Semantics Preserving Model Composition

نویسنده

  • Jon Oldevik
چکیده

Separation of concerns (SoC) and modularisation are well established strategies for managing complex specifications [1, 2]. However, although software is designed with SoC in mind, the language mechanisms at hand often lead to tangling and scattering of concerns. This has motivated a range of language extensions to support concern specification, such as aspects and subjects in programming and modelling. The current trend is modularisation of cross-cutting concerns into units, e.g. aspects, that can later be composed by some transformation process (composition/merging/weaving). An important issue in this process is how the semantics of the models/programs is preserved. The focus of this PhD work is on composition and configuration of software specifications from a modelling perspective. Standard mechanisms in modelling (e.g. in UML) provide composition and configuration with well understood characteristics. Examples from UML are class redefinitions, composite structures, composite states, structured activities, interaction decomposition, and package merge. This work goes beyond those by exploring modelling and composition of concerns at a collaboration level, focusing on their architecture and interaction dimensions. The semantics governing such compositions and their results is of particular interest in this regard. I will address how generative techniques can be used for implementing the compositions and guide semantics preservation. I will also address what semantics preservation means in different modelling and composition contexts. UML is used as the language for experimentation, as this is the de-facto standard for software modelling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A duality between LM-fuzzy possibility computations and their logical semantics

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

متن کامل

Exploiting Symmetries in Stochastic Process Algebras

Stochastic Process Algebras have been introduced to enable compositional performance analysis of parallel and distributed systems. As with other high level modelling formalisms, state space explosion is a frequently observed problem, especially if the system consists of many cooperating components. However, if the components are identical replicas of each others, the state space can be reduced ...

متن کامل

Profunctors, open maps and bisimulation

This paper studies fundamental connections between profunctors (i.e., distributors, or bimodules), open maps and bisimulation. In particular, it proves that a colimit preserving functor between presheaf categories (corresponding to a profunctor) preserves open maps and open map bisimulation. Consequently, the composition of profunctors preserves open maps as 2-cells. A guiding idea is the view ...

متن کامل

Compositional verification of model-level refactorings based on graph transformations

With the success of model-driven development as well as component-based and service-oriented systems, models of software architecture are key artifacts in the development process. To adapt to changing requirements and improve internal software quality such models have to evolve while preserving aspects of their behaviour. These behaviour preserving developments are known as refactorings. The ve...

متن کامل

Homogeneous Semantics Preserving Deployments of Heterogeneous Networks of Embedded Systems

Tagged systems provide a denotational semantics for embedded systems. A heterogeneous network of embedded systems can be modeled mathematically by a network of tagged systems. Taking the heterogeneous composition of this network results in a single, homogeneous, tagged system. The question this paper addresses is: when is semantics (behavior) preserved by composition? To answer this question, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007